Internal Dictionary Matching
نویسندگان
چکیده
We introduce data structures answering queries concerning the occurrences of patterns from a given dictionary $$\mathsf {D}$$ in fragments string T length n. The is internal sense that each pattern as fragment T. This way, takes space proportional to number $$d=|\mathsf {D}|$$ rather than their total length, which could be $$\varTheta (n\cdot d)$$ . In particular, we consider following types queries: reporting and counting all $$T[i \mathinner {.\,.}j]$$ distinct occur show how construct, $$O((n+d) \log ^{O(1)} n)$$ time, structure answers these time $$O(\log n+| output |)$$ case much more involved needs combination locally consistent parsing with orthogonal range searching. Reporting patterns, on other hand, uses maximal repetitions strings. Finally, provide tight—up subpolynomial factors—upper lower bounds for dynamic dictionary.
منابع مشابه
Two-Dimensional Dictionary Matching
Most traditional pattern matching algorithms solve the problem of finding all occurrences of a given pattern string P in a given text T . Another important paradigm is the dictionary matching problem. Let D = {P1, ..., Pk} be the dictionary. We seek all locations of dictionary patterns that appear in a given text T . Previous dictionary matching algorithms have all involved exact matching of a ...
متن کاملEfficient Approximate Dictionary Matching
Named entity recognition (NER) systems are important for extracting useful information from unstructured data sources. It is known that large domain dictionaries help in improving extraction performance of NER. Unstructured text usually contains entity mentions that are different from their standard dictionary form. Approximate matching is important to identify the correct dictionary entity for...
متن کاملDictionary Matching with One Gap
The dictionary matching with gaps problem is to preprocess a dictionary D of d gapped patterns P1, . . . , Pd over alphabet Σ, where each gapped pattern Pi is a sequence of subpatterns separated by bounded sequences of don’t cares. Then, given a query text T of length n over alphabet Σ, the goal is to output all locations in T in which a pattern Pi ∈ D, 1 ≤ i ≤ d, ends. There is a renewed curre...
متن کاملFast circular dictionary-matching algorithm
Citing this paper Please note that where the full-text provided on King's Research Portal is the Author Accepted Manuscript or Post-Print version this may differ from the final Published version. If citing, it is advised that you check and use the publisher's definitive version for pagination, volume/issue, and date of publication details. And where the final published version is provided on th...
متن کاملDictionary Selection Using Partial Matching
This work concerns the search for text compressors that compress better than existing dictionary coders, but run faster than statistical coders. We describe a new method for text compression using multiple dictionaries, one for each context of preceeding characters, where the contexts have varying lengths. The context to be used is determined using an escape mechanism similar to that of predict...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2021
ISSN: ['1432-0541', '0178-4617']
DOI: https://doi.org/10.1007/s00453-021-00821-y